Testing and Reconfiguration of VLSI Linear Arrays
نویسندگان
چکیده
Achieving fault tolerance through incorporation of redundancy and reconfiguration is quite common. In this paper we study the fault tolerance of linear arrays of N processors with k bypass links whose maximum length is g. We consider both arrays with bidirectional links and unidirectional links. We first consider the problem of testing whether a set of n faulty processors is catastrophic, i.e., precludes reconfiguration. We provide new testing algorithms which improve and generalize known testing algorithms. For bidirectional arrays we provide an O(kn) time testing algorithm and for unidirectional arrays we provide an O(n) time algorithm for the case k = I, and an O(kn log k) time algorithm, for the case k > 1. When the fault pattern is not catastrophic we study the problem of finding an optimal reconfiguration of the array. We consider optimality with respect to two parameters: the size of the reconfigured array and the number of redundant links to activate. Considering optimality with respect to the size of the reconfigured array, we prove that the problem is NP-hard in the strong sense if the bypass links are bidirectional, while it can be solved in O(kng) time if the bypass links are unidirectional. Considering optimality with respect to the number of bypass links to activate, we prove that the problem can be solved in O(kn) time if the bypass links are bidirectional, and in O(kng) time if the bypass links are unidirectional. @ 1998-Elsevier Science B.V. All rights reserved Kr~~vor& Array processors; Catastrophic fault patterns; Fault tolerance; Fault detection; Reconfiguration algorithms * Corresponding author. E-mail: [email protected]. ’ Part of this work appeared in Proceedings of the 3rd Workshop on Algorithms and Data Structures, Lecture Notes in Computer Science, vol. 709 (1993) 553-564. 0304-3975/98/$19.00 @ 1998 -Elsevier Science B.V. All rights reserved PII SO304-3975(97)00238-7 172 R. De Prisco et al. I Theoretical Computer Science 197 (1998) 171-188
منابع مشابه
Optimal Reconfiguration of Solar Photovoltaic Arrays Using a Fast Parallelized Particle Swarm Optimization in Confront of Partial Shading
Partial shading reduces the power output of solar modules, generates several peak points in P-V and I-V curves and shortens the expected life cycle of inverters and solar panels. Electrical array reconfiguration of PV arrays that is based on changing the electrical connections with switching devices, can be used as a practical solution to prevent such problems. Valuable studies have been perfor...
متن کاملReliability of VLSI Linear Arrays with Redundant Links
Reliability is one of the most important attributes of any system. Adding redundancy is one way to improve the reliability. In this paper, we consider linear VLSI arrays in which each processor has a set of redundant links to bypass faulty processor(s). It is known that patterns of faults occurring at strategic locations in such arrays can be catastrophic and may render the system unusable rega...
متن کاملCharacterization of catastrophic faults in two-dimensional reconfigurable systolic arrays with unidirectional links
The catastrophic fault pattern is a pattern of faults occurring at strategic locations that may render a system unusable regardless of its component redundancy and of its reconfiguration capabilities. In this paper, we extend the characterization of catastrophic fault patterns known for linear arrays to two-dimensional VLSI arrays in which all links are unidirectional. We determine the minimum ...
متن کاملTowards a Strongly Fault Tolerant VLSI Processor Array
In this paper a novel methodology to achieve fault tolerance in VLSI Array Processors is proposed. A “Fence” based approach is adopted in which the logic array is partitioned and spares are distributed along the boundary of the active array. The emulator as in conventional fault tolerance techniques takes care of fault mapping and reconfiguration. The latency, reconfiguration interconnect lengt...
متن کاملDifferential Reconfiguration Architecture suitable for a Holographic Memory
Optically Reconfigurable Gate Arrays (ORGAs), by exploiting the large storage capacity of holographic memory, offer the possibility of providing a virtual gate count that is much larger than those of currently available VLSI circuits. In such cases, because circuits implemented on a gate array often must be changed with virtual circuits stored in a holographic memory, rapid reconfiguration is n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 197 شماره
صفحات -
تاریخ انتشار 1998